Systolic Tree !-Languages
نویسندگان
چکیده
The class of !-languages recognized by systolic tree automa-ta is introduced. That class extends the class of B uchi !-languages and is closed under boolean operations. The emptiness problem for systolic tree automata on innnite sequences is decidable. A characterization of sys-tolic tree !-languages in terms of a (suitable) concatenation of ((nitary) systolic tree languages is also provided.
منابع مشابه
Systolic Tree ! - Languages : The Operational andthe Logical
The class of !-languages recognized by systolic (binary) tree automata is introduced. That class extends the class of B uchi !-languages though maintaining the closure under union, intersection and complement and the decidability of emptiness. The class of systolic tree !-languages is characterized in terms of a (suitable) concatenation of ((nitary) systolic tree languages. A generalization of ...
متن کاملA Logical Characterization of Systolic Languages
In this paper we study, in the framework of mathematical logic, L(SBTA) i.e. the class of languages accepted by Systolic Binary Tree Automata. We set a correspondence (in the style of B uchi Theorem for regular languages) between L(SBTA) and MSOSig], i.e. a decid-able Monadic Second Order logic over a suitable innnite signature Sig. We also introduce a natural subclass of L(SBTA) which still pr...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملSuccinctness of Descriptions of SBTA-Languages
Systolic Binary Tree Automata (SBTA) provide a basic and robust model for one-way parallel computations on binary tree networks of memoryless processors. In this paper we investigate succinctness of descriptions of languages accepted by SBTA, measured in terms of the number of states of minimal SBTA. We study the problem in diierent settings. First we provide various criteria to determine lower...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007